翻訳と辞書 Words near each other ・ Shigeki Tanaka ・ Shigeki Toyoshima ・ Shigeki Tsujimoto ・ Shigeki Wakabayashi ・ Shigeki Yano ・ Shigeko ・ Shiftee ・ Shifter ・ Shifter (bicycle part) ・ Shifters ・ Shiftgig ・ Shifting (linguistics) ・ Shifting balance theory ・ Shifting baseline ・ Shifting Baselines ・ Shifting bottleneck heuristic ・ Shifting burden of persuasion ・ Shifting City ・ Shifting cultivation ・ Shifting dullness ・ Shifting Gears ・ Shifting Gears (Cooder Graw album) ・ Shifting Gears (DJ Z-Trip album) ・ Shifting Gears (Nancy Sinatra album) ・ Shifting nth root algorithm ・ Shifting Realities ・ Shifting Sands ・ Shifting Sands (film) ・ Shifting Skin ・ Shifting standards model Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Shifting bottleneck heuristic ： ウィキペディア英語版 Shifting bottleneck heuristic The Shifting Bottleneck Heuristic is a procedure intended to minimize the time it takes to do work, or specifically, the makespan in a job shop. The makespan is defined as the amount of time, from start to finish, to complete a set of multi-machine jobs where machine order is pre-set for each job. Assuming that the jobs are actually competing for the same resources (machines) then there will always be one or more resources that act as a 'bottleneck' in the processing. This heuristic, or 'rule of thumb' procedure minimises the effect of the bottleneck. The Shifting Bottleneck Heuristic is intended for job shops with a finite number of jobs and a finite number of machines. ==Uses== The Shifting Bottleneck Heuristic is used in manufacturing and service industries that include job shops with constraints on the order that the machines must be used for each job. A good example of a service industry that may use this technique is a hospital. The different areas within a hospital, such as physical examination, x-ray booth, cat scan, or surgery, could all be considered machines for this particular application. A precedence constraint in this context is when one machine must be used before another machine on any given job (or patient). These types of problems with multiple machines are known to be computationally very difficult. The processing time of each job on each machine is given (see chart on right for an example). Job ''j'' being performed on machine ''i'' is denoted ''ij''. It is assumed that each machine can only work on one job at a time. The objective is to determine the schedule that will produce the shortest makespan. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Shifting bottleneck heuristic」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.